Fpt-Algorithms for Minimum-Bends Tours
نویسندگان
چکیده
منابع مشابه
The Rectilinear κ - Bends TSP
We study a hard geometric problem. Given n points in the plane and a positive integer k, the Rectilinear k-Bends Traveling Salesman Problem asks if there is a piecewise linear tour through the n points with at most k bends where every line-segment in the path is either horizontal or vertical. The problem has applications in VLSI design. We prove that this problem belongs to the class FPT (fixed...
متن کاملThe Rectilinear k-Bends TSP
We study a hard geometric problem. Given n points in the plane and a positive integer k, the Rectilinear k-Bends Traveling Salesman Problem asks if there is a piecewise linear tour through the n points with at most k bends where every line-segment in the path is either horizontal or vertical. The problem has applications in VLSI design. We prove that this problem belongs to the class FPT (fixed...
متن کاملA New Approach to Knock - Knee Channel RoutingDorothea
We present a new channel routing algorithm in the knock-knee mode that produces for dense problems area-optimal layouts with minimum total wire length and O(n) bends (n number of nets), where the total number of bends is at most d ? 2 (d density) more than the minimum. The running time is O(n). It thus improves the algorithm in 3] that determines area-optimal layouts with minimum total wire len...
متن کاملThree-dimensional orthogonal graph drawing algorithms
We use basic results from graph theory to design algorithms for constructing three-dimensional, intersection-free orthogonal grid drawings of n vertex graphs of maximum degree 6. The best previous result generated a drawing bounded by an O( √ n) × O( √ n) × O( √ n) box, with each edge route containing up to 16 bends. Our algorithms initiate the study of bend=bounding box trade-o issues for thre...
متن کاملتعبیه ی هندسی درخت درنقاط داخل یک چندضلعی با حداقل تعداد خم
In this paper we consider to embed a tree T with N vertices on a set of N points inside a simple polygon on n vertices and the goal is to minimize the number of bends. The main idea of our algorithm is modeling the problem into graph matching problem and uses the graph matching algorithms. We apply the concept of error-correction transformation and find the appropriate cost function then we per...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Comput. Geometry Appl.
دوره 21 شماره
صفحات -
تاریخ انتشار 2011